L p -distortion and p -spectral gap of finite graphs
نویسندگان
چکیده
منابع مشابه
SPECTRAL SUBSPACES OF L p FOR p < 1
Let Ω be an open subset of Rn. Denote by LpΩ(R n) the closure in Lp(Rn) of the set of all functions ε ∈ L1(Rn)∩Lp(Rn) whose Fourier transform has compact support contained in Ω. The subspaces of the form LpΩ(R n) are called the spectral subspaces of Lp(Rn). It is easily seen that each spectral subspace is translation invariant; i.e., f(x + a) ∈ LpΩ(R) for all f ∈ L p Ω(R n) and a ∈ Rn. Sufficie...
متن کاملThe p-median and p-center Problems on Bipartite Graphs
Let $G$ be a bipartite graph. In this paper we consider the two kind of location problems namely $p$-center and $p$-median problems on bipartite graphs. The $p$-center and $p$-median problems asks to find a subset of vertices of cardinality $p$, so that respectively the maximum and sum of the distances from this set to all other vertices in $G$ is minimized. For each case we present some proper...
متن کامل8 DISTORTION OF MAPPINGS AND L q , p - COHOMOLOGY
We study some relation between some geometrically defined classes of diffeomorphisms between manifolds and the Lq,p-cohomology of these manifolds. Some applications to vanishing and non vanishing results in Lq,pcohomology are given.
متن کاملexistence and approximate $l^{p}$ and continuous solution of nonlinear integral equations of the hammerstein and volterra types
بسیاری از پدیده ها در جهان ما اساساً غیرخطی هستند، و توسط معادلات غیرخطی بیان شده اند. از آنجا که ظهور کامپیوترهای رقمی با عملکرد بالا، حل مسایل خطی را آسان تر می کند. با این حال، به طور کلی به دست آوردن جوابهای دقیق از مسایل غیرخطی دشوار است. روش عددی، به طور کلی محاسبه پیچیده مسایل غیرخطی را اداره می کند. با این حال، دادن نقاط به یک منحنی و به دست آوردن منحنی کامل که اغلب پرهزینه و ...
15 صفحه اولL(p,1)-labelling of graphs
An L(p, 1)-labelling of a graph is a function f from the vertex set to the positive integers such that |f(x) − f(y)| ≥ p if dist(x, y) = 1 and |f(x)− f(y)| ≥ 1 if dist(x, y) = 2, where dist(x, y) is the distance between the two vertices x and y in the graph. The span of an L(p, 1)labelling f is the difference between the largest and the smallest labels used by f plus 1. In 1992, Griggs and Yeh ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the London Mathematical Society
سال: 2014
ISSN: 0024-6093
DOI: 10.1112/blms/bdt096